Applying Parallel Recursive Genetic Algorithms to Stackelberg Location Problem with Side-trip Distance
نویسندگان
چکیده
منابع مشابه
Applying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملApplying Genetic Algorithms to Solve the Fuzzy Optimal Profit Problem
This study investigated the application of genetic algorithms for solving a fuzzy optimization problem that arises in business and economics. In this problem, a fuzzy price is determined using a linear or a quadratic fuzzy demand function as well as a linear cost function. The objective is to find the optimal fuzzy profit, which is derived from the fuzzy price and the fuzzy cost. The traditiona...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملUsing Hybrid Genetic Algorithms to Solve Discrete Location Allocation Problems with Rectilinear Distance
This paper presents a hybrid genetic algorithm to solve the uncapacitated location allocation problems as a combinatorial optimization problem. The proposed method incorporates a modified K-means algorithm that clusters the customers into groups based on the rectilinear distance, and then the initial population of solutions is calculated according to the derived centers of clusters. The hybrid ...
متن کاملApplying Genetic Algorithms To The Dial-A-Ride Problem With Time Windows
The Dial-a-ride problem with time windows (DARPTW) assigns and schedules users transport requests to a fleet of vehicles enabled to fulfill the required service. The literature offers different heuristics for solving DARPTW problems, which are based on the extension of traditional graph search algorithms. On the other hand, the approach through Genetic Algorithms (GA) has been experienced in pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Japan Association for Management Systems
سال: 2015
ISSN: 1884-2089,2188-2460
DOI: 10.14790/ijams.7.31